Using difunctional relations in information organization

An algorithm for information organization based on rectangular decomposition of a binary relation is introduced, Rectangular decomposition allows a classification of databases presented as a binary relation. This problem, being NP-Complete problem, has been the subject of several previous works. However, we found out necessary the proposition of an approximate polynomial algorithm and to give an improvement to the latest methods. Hence, this work represents a rectangular decomposition approach based on Riguet difunctional relation. The computing of this difunctional results in a set of isolated points allowing us to determine the minimal set of rectangles covering given binary relation. (C) 2000 Elsevier Science Inc, All rights reserved.